Counting Points for Hyperelliptic Curves of Type y2= x5 + ax over Finite Prime Fields

Counting rational points on Jacobian varieties of hyperelliptic curves over finite fields is very important for constructing hyperelliptic curve cryptosystems (HCC), but known algorithms for general curves over given large prime fields need very long running times. In this article, we propose an extremely fast point counting algorithm for hyperelliptic curves of type y = x + ax over given large prime fields Fp, e.g. 80-bit fields. For these curves, we also determine the necessary condition to be suitable for HCC, that is, to satisfy that the order of the Jacobian group is of the form l · c where l is a prime number greater than about 2 and c is a very small integer. We show some examples of suitable curves for HCC obtained by using our algorithm. We also treat curves of type y = x + a where a is not square in Fp.